CORRECTION: At run time initialization we will write:
scanf("%d", &a[i]);
Discussed need of array, declaration of array, initialization of array, memory representation of array (data structures and algorithms)
Main operations on arrays: Traversal, Insertion, Deletion, searching, sorting This video explains traversal and insertion operations with code (C program), Insertion at the beginning, insertion at the end, insertion at any position.
Discussed how to delete data from array in data structure with C program.
Discussed the relationship between arrays and pointers in data structure with example and code.
In this video, we will see how we can work with 2-D(two dimensional) arrays using pointers. I have explained how 2-D arrays are organized in memory and how pointer arithmetic and dereferencing can be used to work with 2-D arrays.
In this video, I have described linked list data structure. I have analyzed limitations of array data structure and tried to discuss need of linked list.
Discussed types of linked list: Singly linked list, Doubly linked list, Circular linked list, Doubly Circular linked list
In this video we will compare arrays with linked lists based on various factors and understand cost of various operations with these data structures
CORRECTION: @24:10 initialize choice variable with 1 by writing:
int choice=1;
In this video we will see implementation of basic operations like create a node in linkedlist and traverse a linkedlist.
In this video we will see how to insert a node in linked list - at beginning, at end and at any given position with example. we will also write a C program for insertion operation.
In this video we have written a C program for deletion operation in linked list. We have discussed how to delete a node form singly linked list (from beginning, from end, from given position) with examples.
In this video I have written a C program to find the length of a singly linked list using iterative approach. Analyzed and discussed the getlength function with example.
In this lecture I have written C program to reverse a singly linked list. I have followed iterative approach to solve this problem.
In this video, I have explained deletion from doubly linked list with C program. I have explained all the cases: (with examples)
In this video I have written a C program to reverse a doubly linked list as well as I have discussed how to reverse a DLL with example.
In this video I have written a C program for implementation (creation and display) of a circular linked list.
Here I have written a C program to create a circular linked list and to display the content of that circular linked list. I have discussed the implementation of circular linked list maintaining only tail pointer as well as both head and tail pointer.
In this video, I have written a C program for inserting a node in a circular linked list. I have discussed all the cases of insertion- (with example)
In this video, I have written a C program for deletion from circular linked list. Discussed all the cases of deletion with example -
In this lecture, I have written C program to reverse circular linked list. This is an important interview question. I have solved this using iterative approach.
Here I have written a C program to create and display a doubly circular linked list.
In this lecture, I have written a C program for insertion in doubly circular linked list. Discussed all the cases of insertion with examples-
In this lesson, I have written a C program for deletion from a doubly circular linked list. Discussed all cases to delete a node with example:
In this lecture, I have described stack as abstract data type, introduction to stack and various operations performed on stack with example.
Here I have discussed array based implementation of stack data structure. Explained all the operations(push, pop, peek, traverse) with C program.
Here I have discussed linked list implementation of stack data structure. I have written a C program for implementation of stack using linked list.
In this lecture, I have described infix prefix and postfix notations which are ways to write arithmetic and logical expressions. I have also discussed how to evaluate infix prefix and postfix expressions with examples.
In this video, I have explained the conversion of INFIX expression to POSTFIX expression using STACK. Keeping in mind the priority of operators(precedence) as well as associativity of operators. Associativity comes into picture when two operators of the same precedence arrive like addition and subtraction, multiplication and division etc.
In this lecture, I have discussed an efficient algorithm to convert infix to postfix using stack in data structure.
In this video, I have explained the conversion of INFIX expression to POSTFIX expression using STACK with the help of examples. Keeping in mind the priority of operators(precedence) as well as associativity of operators. Associativity comes into picture when two operators of the same precedence arrive like addition and subtraction, multiplication and division etc.
In this lecture, I have described an efficient algorithm for infix to prefix conversion using stack in data structure. Also discussed infix to prefix conversion without stack with example and analyzed both the approaches.
In this lecture I have described how we can evaluate prefix and postfix expressions efficiently using stack data structure.
In this video, I have explained the Evaluation of Postfix Expression Using Stack with the help of an example.
Keeping in mind the priority of operators(precedence) as well as associativity of operators. Associativity comes into picture when two operators of the same precedence arrive like addition and subtraction, multiplication and division etc
learn how to convert prefix expression to infix expression using Stack with example Also learn how to convert postfix expression to infix expression with example in data structures and algorithms.
In this lecture I have discussed how to construct a binary expression tree from infix expression in data structure with example.
In this lecture, I have discussed how to construct a binary expression tree from postfix using stack in data structures. It is easy to construct expression tree from postfix because we don't need to care about precedence and associativity rule.
In this lecture, I have described queue data structure as abstract data type. Discussed introduction to queue with its operations.
In this lecture I have described array based implementation of queue data structure. I have written C program to implement queue using arrays.
In this lecture I have explained implementation of queue using linked list with example. I have written C program for linked list implementation of queue data structure.
In this lecture I have described circular queue implementation using arrays as well as analysed the drawback of linear queue. I have written C program for implementation of queue using arrays.
In this lecture I have written C program for implementation of circular queue using linked list. Analyzed and discussed the code with example.
Discussed how to implement queue using stacks with example. I have written a C program for implementation of queue using stacks
In this lecture, I have Deque (Double Ended Queues), types of deque and application of deque in data structure.
In this lecture I have written C program to implement DEQUE(Double Ended Queue) using circular array. Discussed all the operations on deque data structure.
Discussed the logical model of tree data structure in computer programming. I have discussed tree as a non-linear hierarchical data structure, tree terminologies and its applications in detail.
CORRECTION:
at 5:42 there should be 1
at 7:30 the sum will be 15
In this video, I have discussed binary tree with its properties. I have talked about different types of binary tree like - Full binary tree, Complete binary tree, Perfect binary tree with their properties.
In this lecture, I have implemented binary tree in C/C++. I have written a C program to create a binary tree of integers.
Discussed how a binary tree is represented in memory using an array.
Array representation of Binary tree in Data structures.
Explained binary tree traversals (Inorder, Preorder and Postorder) with the help of an example.
In this lecture, I have described preorder, inorder and postorder algorithms for binary tree and I have written a C program for binary tree traversal.
Learn how to construct Binary Tree from preorder and inorder traversals.
learn how to construct a binary tree from Postorder and Inorder traversal.
Construction of binary tree from postorder and preorder traversal with example.
In Todays Video I explained Binary Search Trees (BST) - Insertion and Deletion
In this Video I have explained how to construct binary search tree(BST) from given preorder traversal.
Learn how to construct a binary search tree (BST) from given postorder traversal with example.
Explained basics of AVL Tree with example | AVL Tree Rotations(LL,RR,LR,RL) with example
Learn how to construct AVL tree from given data (example with solution). AVL tree insertion and rotations.
In Todays Video I explained How to Delete Data from AVL Tree (with Example)
In this lecture I have discussed basics of Red Black trees, need of Red Black trees, AVL trees vs Red Black Trees, properties of Red Black Trees with examples.
Explained how to do insertion in red black tree
In this lecture, I have explained all the cases of deletion in red black tree with example.
@8:05: Case 1(if red node, just delete it)
@16:05:- All the cases when we delete a black node who is having black children
@45:47:- example of red black tree deletion(all the cases with the help of one example)
Correction: at14:21 9 will be left child of 10
In this lecture I have discussed basics of Splay tree, rotations used in splay tree, advantages and drawbacks of splay tree, applications of splay tree.
In this lecture, I have described how to do insertion in splay tree with the help of an example. I have also written algorithm for insertion and for splaying operation.
In this lecture, I have discussed how to delete data from splay trees with an example. I have explained all the cases of deletion.
In this lecture , I have discussed how to delete data from splay tree using Top down approach. Discussed all the cases of deletion with example and also written algorithm for deletion.
In this lecture I have explained b-tree data structure with its properties. A B-tree is a tree data structure that keeps data sorted and allows searches, insertions, and deletions in logarithmic amortized time.
In this video, I will show you How to insert data in a B-Tree of order 3.
Learn how to insert data in b tree of order 5 with example in data structures and algorithms.
learn how to insert data in b tree of order 5 with given alphabets.
Learn how to insert data in b tree of order 4 in data structures and algorithms
Discussed all cases of deleting a key from b tree. learn how to delete data from b-tree
Learn how to insert data in b+ tree of order 4. Step by step instructions showing the insertion process in b+ tree
Discussed all the cases of deleting a key from b+ tree with example. Step by step instructions showing how to delete data from b+ tree.
In this video, I have explained the two most popular methods(Adjacency Matrix and Adjacency List) for representing the graph in the computer.
In this video, I have explained BFS and DFS Graph Traversal | BFS (Breadth First Search) DFS (Depth First Search), BFS with help of Queue data structure and DFS with the help of Stack data structure.
In this video, I have explained the classification of edges (Tree edge, Forward Edge, Back Edge, Cross edge) in Depth-First Search traversal in a directed graph.
In this lecture, I have explained minimum spanning tree with its properties and with example.
Learn how to find out minimum spanning tree using prim's algorithm in data structures.
Learn how to find out a minimum spanning tree using Kruskals algorithm in data structure.
In this video, I have discussed one question on minimum spanning tree which would be helpful in UGC NET exam preparation.
Cycle in directed graph using DFS traversal.
This video talks about the detection of a cycle in undirected Graph using Breadth First Search(BFS) traversal.
In today's Video I have explained Topological Sorting (with Examples) | How to find all topological orderings of a Graph
Learn how to find Connected components in an undirected graph using depth-first search(DFS).
In this video I have explained how to find all bridges in a graph using DFS Traversal. Bridge is also known as cut edge.
In this video I have explained Dijkstra's Algorithm with some Examples. It is single source shortest path algorithm and use greedy method.
Step by step instructions showing how to run the Bellman-Ford Algorithm on a graph to find out the shortest distance of all the vertices from a single source vertex. Drawbacks of the Bellman-Ford algorithm as well as the Time Complexity of this algorithm.
In this video I have explained Floyd Warshall Algorithm for finding shortest paths in a weighted graph. It is all pair shortest path graph algorithm. It uses dynamic programming approach.
What is linear search? Linear search algorithm full explanation with code. Step by step instruction showing how linear search works.
CORRECTION: In the while loop the condition should be l less than equal to r.
Discussed binary search algorithm-divide and conquer method, analysis of binary search algorithm, iterative method, time complexity of binary search
Discussed bubble sort algorithm and its program with an example. Time complexity has also been calculated both in BEST case and WORST case.
Discussed selection sort algorithm and program in Data Structures with example
Discussed merge sort algorithm with an example. Step by step instructions on how merging is to be done with the code of merge function.
CORRECTION: at 42:50 heapify call for delete logic would be maxheapify(A, i-1,1) and in maxheapify method instead of while loop we can write if statement. :)
Discussed Heap sort and heapify method to create a max heap form array. Step by step instructions showing how to run heap sort with its pseudocode.
Step by step instructions showing how shell sort works with example and its code. Analysis of shell sort has also been done.
Discussed counting sort algorithm with its code. Step by step guide showing how to sort an array using count sort. Analysis of counting sort (Time Complexity)
Discussed Radix sort with its code, analysis of radix sort. Step by step instructions showing how radix sort works.
In this video, I have explained hashing methods(Chaining and Linear Probing) which are used to resolve the collision.
Learn how to resolve collision using Quadratic Probing technique. In Hashing this is one of the technique to resolve collosion.
In this video, I have explained the concept of double hashing technique which is used to resolve the collision.
In this video, I have explained how to compress a message using Fixed sized codes and Variable sized codes(Huffman Coding) with proper example.
In this video, I have discussed two questions on Huffman coding which were asked in UGC NET computer science and GATE computer science exam.
